A lightweight cell switching and traffic offloading scheme for energy optimization in ultra-dense heterogeneous networks

One of the major capacity boosters for 5G networks is the deployment of ultra-dense heterogeneous networks (UDHNs). However, this deployment results in a tremendous increase in the energy consumption of the network due to the large number of base stations (BSs) involved. In addition to enhanced capacity, 5G networks must also be energy efficient for it to be economically viable and environmentally friendly. Dynamic cell switching is a very common way of reducing the total energy consumption of the network, but most of the proposed methods are computationally demanding, which makes them unsuitable for application in ultra-dense network deployment with massive number of BSs. To tackle this problem, we propose a lightweight cell switching scheme also known as Threshold-based Hybrid cEll swItching Scheme (THESIS) for energy optimization in UDHNs. The developed approach combines the benefits of clustering and exhaustive search (ES) algorithm to produce a solution whose optimality is close to that of the ES (which is guaranteed to be optimal), but is computationally more efficient than ES and as such can be applied for cell switching in real networks even when their dimension is large. The performance evaluation shows that THESIS significantly reduces the energy consumption of the UDHN and can reduce the complexity of finding a near-optimal solution from exponential to polynomial complexity.     

基于改进克隆选择算法的统一混沌系统同步控制与参数辨识

提出一种改进的克隆选择算法用于解决混沌系统的参数辨识问题.该算法利用抗体的高频变异和受体编辑两种机制有效平衡算法的全局探索与局部开发，并引入向精英抗体学习策略进一步提高算法的收敛质量.对10个优化问题的实验表明：所提出算法在求解精度、收敛速度以及稳定性方面具有更好的性能.以参数未知统一混沌系统的同步控制为研究对象，合理设计同步控制器，并对同步系统的稳定性进行理论分析.通过对同步比例因子的设置，实现统一混沌系统的完全同步、反同步、投影同步等多种同步方式.仿真实验结果表明该方法能够实现对未知系统参数的精确辨识以及驱动-响应系统的有效同步控制，验证了所提方法的可行性与有效性.     

Diffusive search with spatially dependent resetting

We consider a stochastic search model with resetting for an unknown stationary target $a\in \mathbb{R}$ with known distribution $\mu$. The searcher begins at the origin and performs Brownian motion with diffusion constant $D$. The searcher is also armed with an exponential clock with spatially dependent rate $r=r\left(\cdot \right)$, so that if it has failed to locate the target by the time the clock rings, then its position is reset to the origin and it continues its search anew from there. Denote the position of the searcher at time $t$ by $X\left(t\right)$. Let $E_0^{\left(r\right)}$ denote expectations for the process $X\left(\cdot \right)$. The search ends at time $T_a=inf\{t\ge 0:X\left(t\right)=a\}$. The expected time of the search is then ${\int }_{\mathbb{R}}\left(E_0^{\left(r\right)}{T}_a\right)\mu \left(da\right)$. Ideally, one would like to minimize this over all resetting rates $r$. We obtain quantitative growth rates for $E_0^{\left(r\right)}{T}_a$ as a function of $a$ in terms of the asymptotic behavior of the rate function $r$, and also a rather precise dichotomy on the asymptotic behavior of the resetting function $r$ to determine whether $E_0^{\left(r\right)}{T}_a$ is finite or infinite. We show generically that if $r\left(x\right)$ is of the order ${\left|x\right|}^{2l}$, with $l>-1$, then $log{E}_0^{\left(r\right)}{T}_a$ is of the order ${\left|a\right|}^{l+1}$; in particular, the smaller the asymptotic size of $r$, the smaller the asymptotic growth rate of $E_0^{\left(r\right)}{T}_a$. The asymptotic growth rate of $E_0^{\left(r\right)}{T}_a$ continues to decrease when $r\left(x\right)\sim \frac{D\lambda }{x^2}$ with $\lambda >1$; now the growth rate of $E_0^{\left(r\right)}{T}_a$ is more or less of the order ${\left|a\right|}^{\frac{1+\sqrt{1+8\lambda }}{2}}$. Note that this exponent increases to $\infty$ when $\lambda$ increases to $\infty$ and decreases to 2 when $\lambda$ decreases to 1. However, if $\lambda =1$, then $E_0^{\left(r\right)}{T}_a=\infty$, for $a\ne 0$. Our results suggest that for many distributions $\mu$ supported on all of $\mathbb{R}$, a near optimal (or optimal) choice of resetting function $r$ in order to minimize ${\int }_{{\mathbb{R}}^d}\left(E_0^{\left(r\right)}{T}_a\right)\mu \left(da\right)$ will be one which decays quadratically as $\frac{D\lambda }{x^2}$ for some $\lambda >1$. We also give explicit, albeit rather complicated, variational formulas for ${inf}_{r\gneqq 0}{\int }_{{\mathbb{R}}^d}\left(E_0^{\left(r\right)}{T}_a\right)\mu \left(da\right)$. For distributions $\mu$ with compact support, one should set $r=\infty$ off of the support. We also discuss this case.     

具有复合幂函数和共存吸引子的新混沌系统的动力学分析与电路仿真

构造一个具有复合幂函数的三维连续自治混沌系统。系统的状态方程仅有5项，其中一项是指数小于1的复合幂函数。该系统具有结构简单、非双曲平衡点、吸引子共存的性质，展现出了复杂的动力学行为。首先，对系统的动力学行为进行分析，包括李雅普诺夫（Lyapunov）指数谱、分岔图以及庞加莱映射等，结果表明此系统具有混沌特性。然后进行混沌系统的电路设计，电路仿真结果验证了理论分析的正确性。     

A Reactive Molecular Dynamics Study of Chlorinated Organic Compounds. Part II: A ChemTraYzer Study of Chlorinated Dibenzofuran Formation and Decomposition Processes

In our two-paper series, we first present the development of ReaxFF CHOCl parameters using the recently published ParAMS parametrization tool. In this second part, we update the reactive Molecular Dynamics – Quantum Mechanics coupling scheme ChemTraYzer and combine it with our new ReaxFF parameters from Part I to study formation and decomposition processes of chlorinated dibenzofurans. We introduce a self-learning method for recovering failed transition-state searches that improves the overall ChemTraYzer transition-state search success rate by 10 percentage points to a total of 48 %. With ChemTraYzer, we automatically find and quantify more than 500 reactions using transition state theory and DFT. Among the discovered chlorinated dibenzofuran reactions are numerous reactions that are new to the literature. In three case studies, we discuss the set of reactions that are most relevant to the dibenzofuran literature: (i) bimolecular reactions of the chlorinated-dibenzofuran precursors phenoxy radical and 1,3,5-trichlorobenzene, (ii) dibenzofuran chlorination and pyrolysis, and (iii) oxidation of chlorinated dibenzofurans.     

顶空气相色谱-质谱联用结合同位素峰形校正检索技术鉴别芝麻油风味成分

采用顶空气相色谱-质谱联用(GC-MS)仪结合同位素峰形校正检索技术鉴别了市售芝麻油风味成分中的71种化合物,占总检出化合物的90.2%。检出化合物可分为吡嗪、吡咯、吡啶、噻唑、噻吩、吲哚、唑、呋喃、醛类和酚类等,其中醛、酚、吡嗪和呋喃类化合物的含量较高,分别占风味成分含量的37.4%,20.1%,10.0%和6.7%。同位素峰形校正检索技术在低分辨率质谱上可对化合物的相对分子质量实现精确测量,从而为低分辨率四极杆质谱确定化合物的元素组成和解析化合物结构提供了重要依据,同时也为芝麻油的成分分析提供了新的技术手段。     

Enhancing network lifespan in wireless sensor networks using deep learning based Graph Neural Network

Inadequate energy of sensors is one of the most significant challenges in the development of a reliable wireless sensor network (WSN) that can withstand the demands of growing WSN applications. Implementing a sleep-wake scheduling scheme while assigning data collection and sensing chores to a dominant group of awake sensors while all other nodes are in a sleep state seems to be a potential way for preserving the energy of these sensor nodes. When the starting energy of the nodes changes from one node to another, this issue becomes more difficult to solve. The notion of a dominant set-in graph has been used in a variety of situations. The search for the smallest dominant set in a big graph might be time-consuming. Specifically, we address two issues: first, identifying the smallest possible dominant set, and second, extending the network lifespan by saving the energy of the sensors. To overcome the first problem, we design and develop a deep learning-based Graph Neural Network (DL-GNN). The GNN training method and back-propagation approach were used to train a GNN consisting of three networks such as transition network, bias network, and output network, to determine the minimal dominant set in the created graph. As a second step, we proposed a hybrid fixed-variant search (HFVS) method that considers minimal dominant sets as input and improves overall network lifespan by swapping nodes of minimal dominating sets. We prepared simulated networks with various network configurations and modeled different WSNs as undirected graphs. To get better convergence, the different values of state vector dimensions of the input vectors are investigated. When the state vector dimension is 3 or 4, minimum dominant set is recognized with high accuracy. The paper also presents comparative analyses between the proposed HFVS algorithm and other existing algorithms for extending network lifespan and discusses the trade-offs that exist between them. Lifespan of wireless sensor network, which is based on the dominant set method, is greatly increased by the techniques we have proposed.     

基于麻雀搜索算法结合深度前馈神经网络的近红外模型转移方法研究

该文提出了一种基于麻雀搜索算法结合深度前馈神经网络（SSA－DFN）的近红外光谱模型转移方法。使用深度前馈神经网络拟合不同仪器采集到的光谱之间的非线性函数映射,并将麻雀搜索算法用于网络各层连接权值和阈值的初始化,通过种群中个体位置的迭代更新,求得连接权值和阈值的最优初始值;通过多次调整深度前馈神经网络模型的超参数,使网络拟合效果趋于最优,最终确定转移函数。为验证方法的有效性,分别从烟叶近红外光谱谱图、主成分投影和预测结果的角度,将SSA－DFN方法与分段直接校正算法（PDS）、典型相关性分析算法（CCA）转移前后的效果进行了对比。结果表明SSA－DFN方法转移后的从机光谱与原主机光谱重合度最高,转移后主、从机总糖、烟碱含量的预测结果差异不显著,预测平均误差从8.32%、9.15%分别降至4.65%、4.82%,预测均方根误差（RMSEP）和决定系数（R2）等指标均优于PDS和CCA,取得了最佳的转移效果,可满足企业需求。结果表明该方法是一种有效的模型转移方法。